On a class of strongly regular signed graphs

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On co-regular signed graphs

A graph whose edges are labeled either as positive or negative is called a signed graph. A signed graph is said to be net-regular if every vertex has constant net-degree k, namely, the difference between the number of positive and negative edges incident with a vertex. In this paper, we analyze some properties of co-regular signed graphs which are net-regular signed graphs with the underlying g...

متن کامل

Nowhere-zero flows on signed regular graphs

We study the flow spectrum S(G) and the integer flow spectrum S(G) of odd regular graphs. We show that there are signed graphs where the difference between the integer flow number and the flow number is greater than or equal to 1, disproving a conjecture of Raspaud and Zhu [7]. Let G be a (2t + 1)-regular graph. We show that if r ∈ S(G), then r = 2 + 1t or r ≥ 2 + 2 2t−1 . This result generaliz...

متن کامل

Strongly regular graphs

Strongly regular graphs form an important class of graphs which lie somewhere between the highly structured and the apparently random. This chapter gives an introduction to these graphs with pointers to more detailed surveys of particular topics.

متن کامل

Disconnecting strongly regular graphs

In this paper, we show that the minimum number of vertices whose removal disconnects a connected strongly regular graph into non-singleton components, equals the size of the neighborhood of an edge for many graphs. These include blocks graphs of Steiner 2-designs, many Latin square graphs and strongly regular graphs whose intersection parameters are at most a quarter of their valency.

متن کامل

Hamiltonian strongly regular graphs

We give a sufficient condition for a distance-regular graph to be Hamiltonian. In particular, the Petersen graph is the only connected nonHamiltonian strongly regular graph on fewer than 99 vertices.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Publicationes Mathematicae Debrecen

سال: 2020

ISSN: 0033-3883

DOI: 10.5486/pmd.2020.8760